typedef struct{
	int people;
	int key;
}	pak;
typedef pak ElemType;

typedef struct CirLiNode{
	ElemType data;
	struct CirLiNode *next;
}	CirLiNode;
/*
 * CirList has no front node
 * if the list is empty
 * the node will be null
 */
typedef struct{
	CirLiNode *node;
}	CirList;
int delCL(CirList *c, ElemType *e);				/*elete the current elements, point to the next element*/
int addCL(CirList *c, ElemType e);				/*Inserted e after the current element pointer, and pointe to e*/
int emptyCL(CirList c);							/*Return 1 if it's empty, else return 0*/
void traverseCL(CirList c);						/*Traverse the list*/
